Structured near-optimal channel-adapted quantum error correction

نویسندگان

  • Peter Shor
  • Andrew S. Fletcher
  • Peter W. Shor
  • Moe Z. Win
چکیده

Andrew S. Fletcher,* Peter W. Shor, and Moe Z. Win Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massuchesetts 02139, USA MIT Lincoln Laboratory, 244 Wood Sreet, Lexington, Massachusetts 02420, USA Department of Mathematics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139, USA Received 28 August 2007; published 17 January 2008

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE

The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...

متن کامل

Simple approach to approximate quantum error correction based on the transpose channel

We demonstrate that there exists a universal, near-optimal recovery map—the transpose channel—for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we provide an alternative interpretation of the standard quantum error correction (QEC) conditions and generalize them to a set of conditions for approximate QEC (AQEC...

متن کامل

Optimal and Efficient Decoding of Concatenated Quantum Block Codes

We consider the problem of optimally decoding a quantum error correction code — that is to find the optimal recovery procedure given the outcomes of partial “check” measurements on the system. In general, this problem is NP-hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message passing algorithm. We compare the performan...

متن کامل

On quantum error-correction by classical feedback in discrete time

We consider the problem of correcting the errors incurred from sending quantum information through a noisy quantum environment by using classical information obtained from a measurement on the environment. For discrete time Markovian evolutions, in the case of fixed measurement on the environment, we give criteria for quantum information to be perfectly corrigible and characterize the related f...

متن کامل

Structured optical receivers to attain superadditive capacity and the Holevo limit

Attaining the ultimate (Holevo) limit to the classical capacity of a quantum channel requires the receiver to make joint measurements over long code-word blocks. For a pure-state channel, we show that the Holevo limit can be attained by a receiver that uses a multisymbol unitary transformation on the quantum code word followed by separable projective measurements. We show a concatenated coding ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008